Dynamic Spatial Data Structures - the Voronoi Approach
نویسنده
چکیده
Voronoi diagrams have recently received attention as data structures containing significant information about the spatial adjacency of map objects. Despite their theoretical efficiency, batch construction techniques require complete rebuilding after each modification. Incremental Voronoi creation methods use processes such as insert, delete and move for points, and from these derive insertion and deletion of lines. With these tools a Voronoi spatial data structure may be maintained dynamically while the input data is being modified.
منابع مشابه
Data structures and algorithms to support interactive spatial analysis using dynamic Voronoi diagrams
To support the need for interactive spatial analysis, it is often necessary to rethink the data structures and algorithms underpinning applications. This paper describes the development of an interactive environment in which a number of different Voronoi models of space can be manipulated together in real time, to (1) study their behaviour, (2) select appropriate models for specific analysis ta...
متن کاملWorkshop on Voronoi Methods for Handling Geographic Data Spatial Adjacency as the Basis for Spatial Data Structures
This review is intended to supplement the Spatial Data Handling Symposium Workshop by giving the main lines of argument leading to the development of the Voronoi spatial model. Three points will be emphasized. Firstly, the objects used to create a seamless data structure (i.e. one without holes or joins) are themselves discrete, even if the world they came from is not. Secondly, a flexible data...
متن کاملManaging Spatial Objects with the Vmo-tree
An object-oriented approach is described to model a set of 2D vector data, depicting points, lines, and polygons. These primitive spatial objects are embedded in Euclidean space and are topologically related with the dynamic Voronoi diagram. A spatial object condensation technique is used to partition the Voronoi diagram into smaller subsets. Each subset corresponds to a bounded subspace called...
متن کاملApproximate UV computation based on space decomposition
Voronoi diagrams are commonly used to answer traditional nearestneighbor queries in spatial databases. In this work, we propose a new approach to compute Voronoi-cells for the case of uncertain objects having rectangular uncertainty regions. Since exact computation of Voronoi-cells is a hard problem, we instead propose an approximate solution. The main idea of this solution is to apply hierarch...
متن کاملA Novel Spatial-Temporal Voronoi Diagram-Based Heuristic Approach for Large-Scale Vehicle Routing Optimization with Time Constraints
Vehicle routing optimization (VRO) designs the best routes to reduce travel cost, energy consumption, and carbon emission. Due to non-deterministic polynomial-time hard (NP-hard) complexity, many VROs involved in real-world applications require too much computing effort. Shortening computing time for VRO is a great challenge for state-of-the-art spatial optimization algorithms. From a spatial-t...
متن کامل